On the Size of Induced Acyclic Subgraphs in Random Digraphs
نویسندگان
چکیده
Let D ∈ D(n, p) denote a simple random digraph obtained by choosing each of the ` n 2 ́ undirected edges independently with probability 2p and then orienting each chosen edge independently in one of the two directions with equal probability 1/2. Let mas(D) denote the maximum size of an induced acyclic subgraph in D. We obtain tight concentration results on the size of mas(D). Precisely, we show that
منابع مشابه
Induced acyclic subgraphs in random digraphs: Improved bounds
Given a simple directed graph D = (V,A), let the size of the largest induced directed acyclic graph (dag) be denoted by mas(D). Let D ∈ D(n, p) be a random instance, obtained by choosing each of the ( n 2 ) possible undirected edges independently with probability 2p and then orienting each chosen edge independently in one of two possible directions with probabibility 1/2. We obtain improved bou...
متن کاملAcyclic Colorings and Subgraphs of Directed Graphs
The acyclic chromatic number of a directed graph D, denoted χA(D), is the minimum positive integer k such that there exists a decomposition of the vertices of D into k disjoint sets, each of which induces an acyclic subgraph. We show that for all digraphs D without directed 2-cycles, we have χA(D) ≤ 4 5 · ∆̄(D) + o(∆̄(D)), where ∆̄(D) denotes the maximum arithmetic mean of the out-degree and the i...
متن کاملFinding Induced Acyclic Subgraphs in Random Digraphs
Consider the problem of finding a large induced acyclic subgraph of a given simple digraph D = (V,E). The decision version of this problem is NP -complete and its optimization is not likely to be approximable within a ratio of O(n ) for some > 0. We study this problem when D is a random instance. We show that, almost surely, any maximal solution is within an o(ln n) factor from the optimal one....
متن کاملAcyclic Subgraphs of Planar Digraphs
An acyclic set in a digraph is a set of vertices that induces an acyclic subgraph. In 2011, Harutyunyan conjectured that every planar digraph on n vertices without directed 2-cycles possesses an acyclic set of size at least 3n/5. We prove this conjecture for digraphs where every directed cycle has length at least 8. More generally, if g is the length of the shortest directed cycle, we show that...
متن کاملTHE RELATION BETWEEN TOPOLOGICAL ORDERING AND ADJACENCY MATRIX IN DIGRAPHS
In this paper the properties of node-node adjacency matrix in acyclic digraphs are considered. It is shown that topological ordering and node-node adjacency matrix are closely related. In fact, first the one to one correspondence between upper triangularity of node-node adjacency matrix and existence of directed cycles in digraphs is proved and then with this correspondence other properties of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics & Theoretical Computer Science
دوره 10 شماره
صفحات -
تاریخ انتشار 2008